Criteria for informative experiments with subspace identification
نویسندگان
چکیده
منابع مشابه
Criteria for informative experiments with subspace identification
Informative experiments are identification experiments which contain sufficient information for an identification algorithm to discriminate between different models in an intended model set. In this paper, a particular set of identification algorithms, namely subspace based identification, is considered. Criteria for experiments to be informative with these methods in the deterministic setup an...
متن کاملInformative Subspace Learning for Counterfactual Inference
Inferring causal relations from observational data is widely used for knowledge discovery in healthcare and economics. To investigate whether a treatment can affect an outcome of interest, we focus on answering counterfactual questions of this type: what would a patient’s blood pressure be had he/she recieved a different treatment? Nearest neighbor matching (NNM) sets the counterfactual outcome...
متن کاملSubspace system identification
We give a general overview of the state-of-the-art in subspace system identification methods. We have restricted ourselves to the most important ideas and developments since the methods appeared in the late eighties. First, the basis of linear subspace identification are summarized. Different algorithms one finds in literature (Such as N4SID, MOESP, CVA) are discussed and put into a unifyin...
متن کاملClassification in an informative sample subspace
We have developed an Informative Sample Subspace (ISS) method that is suitable for projecting high dimensional data onto a low dimensional subspace for classification purposes. In this paper, we present an ISS algorithm that uses a maximal mutual information criterion to search a labelled training dataset directly for the subspace’s projection base vectors. We evaluate the usefulness of the ISS...
متن کاملSubspace identification with missing data
The paper presents initial results on a subspace method for exact identification of a linear time-invariant system from data with missing values. The identification problem with missing data is equivalent to a Hankel structured lowrank matrix completion problem. The novel idea is to search systematically and use effectively completely specified submatrices of the incomplete Hankel matrix constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Control
سال: 2005
ISSN: 0020-7179,1366-5820
DOI: 10.1080/00207170500073830